Witness Gabriel graphs
نویسندگان
چکیده
We consider a generalization of the Gabriel graph, the witness Gabriel graph. Given a set of vertices P and a set of witness points W in the plane, there is an edge ab between two points of P in the witness Gabriel graph GG−(P,W ) if and only if the closed disk with diameter ab does not contain any witness point (besides possibly a and/or b). We study several properties of the witness Gabriel graph, both as a proximity graph and as a new tool in graph drawing.
منابع مشابه
Linear-Time Recognition of Map Graphs with Outerplanar Witness
Map graphs generalize planar graphs and were introduced by Chen, Grigni and Papadimitriou [STOC 1998, J.ACM 2002]. They showed that the problem of recognizing map graphs is in NP by proving the existence of a planar witness graph W . Shortly after, Thorup [FOCS 1998] published a polynomial-time recognition algorithm for map graphs. However, the run time of this algorithm is estimated to be Ω(n1...
متن کاملWitness (Delaunay) graphs
Proximity graphs are used in several areas in which a neighborliness relationship for input data sets is a useful tool in their analysis, and have also received substantial attention from the graph drawing community, as they are a natural way of implicitly representing graphs. However, as a tool for graph representation, proximity graphs have some limitations that may be overcome with suitable ...
متن کاملWitness Rectangle Graphs
In a witness rectangle graph (WRG) on vertex point set P with respect to witness point set W in the plane, two points x, y in P are adjacent whenever the open rectangle with x and y as opposite corners contains at least one witness point in W . WRGs are representative of a much larger family of witness proximity graphs introduced in two previous papers. We study graph-theoretic properties of WR...
متن کاملWitness Indistinguishable Proofs and Constant Round Zero Knowledge
Blum’s Hamiltonicity protocol. We used Protocol 1.2 to prove this. We let HAM denote the NP-complete language of all Hamiltonian graphs (i.e., n vertex graphs that contain the n-cycle as a subgraph). Blum’s basic protocol for proving membership in HAM is Protocol 1.2. It is a 3-round public-coin proof for HAM with soundness error equal to 1 2 . Theorem 1.3 (Feige Shamir). If a protocol is zero-...
متن کاملDid the Train Reach its Destination: The Complexity of Finding a Witness
Recently, Dohrau et al. [DGK16] studied a zero-player game on switch graphs and proved that deciding the termination of the game is in NP ∩ coNP. In this short paper, we show that the search version of this game on switch graphs, i.e., the task of finding a witness of termination (or of non-termination) is in PLS.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Geom.
دوره 46 شماره
صفحات -
تاریخ انتشار 2013